Deep multi-view semi-supervised clustering with sample pairwise constraints

نویسندگان

چکیده

Multi-view clustering has attracted much attention thanks to the capacity of multi-source information integration. Although numerous advanced methods have been proposed in past decades, most them generally overlook significance weakly-supervised and fail preserve feature properties multiple views, thus resulting unsatisfactory performance. To address these issues, this paper, we propose a novel Deep Semi-supervised Clustering (DMSC) method, which jointly optimizes three kinds losses during networks finetuning, including multi-view loss, semi-supervised pairwise constraint loss autoencoders reconstruction loss. Specifically, KL divergence based is imposed on common representation data perform heterogeneous optimization, weighting prediction simultaneously. Then, innovatively integrate constraints into process by enforcing learned must-link samples (cannot-link samples) be similar (dissimilar), such that formed architecture can more credible. Moreover, unlike existing rivals only encoders for each branch further tune intact frame contains both decoders. In way, issue serious corruption view-specific view-shared space could alleviated, making whole training procedure stable. Through comprehensive experiments eight popular image datasets, demonstrate our approach performs better than state-of-the-art single-view competitors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Semi-supervised Clustering with Pairwise Constraints: A Discriminative Approach

We consider the semi-supervised clustering problem where we know (with varying degree of certainty) that some sample pairs are (or are not) in the same class. Unlike previous efforts in adapting clustering algorithms to incorporate those pairwise relations, our work is based on a discriminative model. We generalize the standard Gaussian process classifier (GPC) to express our classification pre...

متن کامل

A Semi - supervised Text Clustering Algorithm Based on Pairwise Constraints ★

In this paper, an active learning method which can effectively select pairwise constraints during clustering procedure was presented. A novel semi-supervised text clustering algorithm was proposed, which employed an effective pairwise constraints selection method. As the samples on the fuzzy boundary are far away from the cluster center in the clustering procedure, they can be easily divided in...

متن کامل

Kernel Optimization using Pairwise Constraints for Semi-Supervised Clustering

A critical problem related to kernel-based methods is the selection of an optimal kernel for the problem at hand. The kernel function in use must conform with the learning target in order to obtain meaningful results. While solutions to estimate optimal kernel functions and their parameters have been proposed in a supervised setting, the problem presents open challenges when no labeled data are...

متن کامل

Clustering-driven Deep Embedding with Pairwise Constraints

Recently, there has been increasing interest to leverage the competence of neural networks to analyze data. In particular, new clustering methods that employ deep embeddings have been presented. In this paper, we depart from centroid-based models and suggest a new framework, called Clustering-driven deep embedding with PAirwise Constraints (CPAC), for non-parametric clustering using a neural ne...

متن کامل

Semi-Supervised Metric Learning Using Pairwise Constraints

Distance metric has an important role in many machine learning algorithms. Recently, metric learning for semi-supervised algorithms has received much attention. For semi-supervised clustering, usually a set of pairwise similarity and dissimilarity constraints is provided as supervisory information. Until now, various metric learning methods utilizing pairwise constraints have been proposed. The...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Neurocomputing

سال: 2022

ISSN: ['0925-2312', '1872-8286']

DOI: https://doi.org/10.1016/j.neucom.2022.05.091